Identifying Features for Bluff Detection in No-Limit Texas Hold'em
نویسنده
چکیده
Abstract Poker is increasingly becoming an area of inter-Poker is increasingly becoming an area of interest in AI research, partly because of the complex qualities it exhibits which are absent from more traditionally studied games, such as chess. One of the most difficult but also most important aspects of poker is the need to infer information about your opponent while also handling his attempts at disinformation. This problem of “opponent modelling” is a central aspect of poker agent design and has been approached in many different ways. In this paper we focus on one subset of the opponent modelling problem, namely that of bluff detection. We explore the effectiveness of different feature sets towards this task and test the ease with which the bluffs of various poker agents can be detected.
منابع مشابه
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold’em poker. The first player, GS3, is designed for playing limit Texas Hold’em, in which all bets are a fixed amount. The second player, Tartanian, is designed for the no-limit variant of the game, in which the amount bet can be any amount up to the number of chips the player has. Both GS3 and Tartanian are ba...
متن کاملA heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold’em poker. Tartanian is built from three components. First, to deal with the virtually infinite strategy space of no-limit poker, we develop a discretized betting model designed to capture the most important strategic choices in the game. Second, we employ potential-aware automated abstraction algorithms for identif...
متن کاملDecision Generalisation from Game Logs in No Limit Texas Hold'em
Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold’em. We address the problems of determining a suitable action abstraction and the resulting state translation that is required to map real-value bet amounts into a discrete set of abstract a...
متن کاملAlgorithms for Evolving No-Limit Texas Hold'em Poker Playing Agents
Computers have difficulty learning how to play Texas Hold’em Poker. The game contains a high degree of stochasticity, hidden information, and opponents that are deliberately trying to mis-represent their current state. Poker has a much larger game space than classic parlour games such as Chess and Backgammon. Evolutionary methods have been shown to find relatively good results in large state sp...
متن کاملA Heuristic-Based Approach for a Betting Strategy in Texas Hold'em Poker
Artificial intelligence research in Texas Hold’em poker has recently mainly focused on heads-up fixed limit game. Game theoretic methods used in the poker agents capable of playing at the very best level are not easily generalized to other forms of Texas Hold’em poker. In this paper we present a general approach to build a poker agent, where the betting strategy is defined by estimating the exp...
متن کامل